- execution of algorithms
- Программирование: выполнение алгоритмов (IEC 61499-1)
Универсальный англо-русский словарь. Академик.ру. 2011.
execution of algorithms
Смотреть что такое "execution of algorithms" в других словарях:
Analysis of algorithms — To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is… … Wikipedia
Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the … Wikipedia
Outline of computer science — The following outline is provided as an overview of and topical guide to computer science: Computer science (also called computing science) – study of the theoretical foundations of information and computation and their implementation and… … Wikipedia
Topic outline of computer science — Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. One well known subject classification system for computer science is… … Wikipedia
Automata-based programming (Shalyto's approach) — Automata Based Programming is a programming technology [1] . Its defining characteristic is the use of finite state machines to describe program behavior. The transition graphs of a state machines are used in all stages of software development… … Wikipedia
New media — is a broad term in media studies that emerged in the latter part of the 20th century. For example, new media holds out a possibility of on demand access to content any time, anywhere, on any digital device, as well as interactive user feedback,… … Wikipedia
Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… … Wikipedia
Lev Manovich — Manovich at Video Vortex in Brussels in October 2007 Lev Manovich is an author of new media books, professor of Visual Arts, University of California, San Diego, U.S. and European Graduate School in Saas Fee, Switzerland, where he teaches new… … Wikipedia
Digital art — Irrationnal Geometrics digital art installation 2008 by Pascal Dombis A close up of th … Wikipedia
GetTickCount — is a function in the Windows API. It takes no (void) parameters and returns the time since the system was started.Common usageGetTickCount works on all windows platforms that supports the Windows API. It measures time in milliseconds (though it… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
